|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
111-2 |
|
授課對象 |
電機工程學系 |
|
授課教師 |
孫紹華 |
|
課號 |
EE4033 |
|
課程識別碼 |
901E39000 |
|
班次 |
01 |
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
必修 |
|
上課時間 |
星期四2,3,4(9:10~12:10) |
|
上課地點 |
電二106 |
|
備註 |
本課程以英語授課。外系學生加選請於加退選時向授課老師詢問。
限本系所學生(含輔系、雙修生)
總人數上限：60人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
This course provides an introduction to the design and analysis of computer algorithms. We will cover topics including concepts of algorithm complexity, and various algorithms such as divide-and-conquer, dynamic programming, sorting, and greedy algorithms.
For those who would like to add this course (加簽), please fill in this Google form and follow the instruction: https://forms.gle/L9oF8rfauRnP2HE59 |
|
課程目標 |
Upon completion of this course, students will be able to design, analyze, apply, and implement algorithms in common engineering design situations. |
|
課程要求 |
A strong understanding of programming and data structure, as well as a solid background in discrete mathematics, including probability, are necessary prerequisites to this course. Students must be able to program in C＋＋ or C on the Linux platform. |
|
預期每週課後學習時數 |
|
|
Office Hours |
備註： by appointment |
|
指定閱讀 |
|
|
參考書目 |
|
|
評量方式
(僅供參考) |
|
|
週次 |
日期 |
單元主題 |
|
Week 1 |
2/23 |
Opening & Asymptotic Analysis: CH1, CH2, CH3
PA #0
PA #1 out
HW #1 out |
|
Week 2 |
3/2 |
Divide and Conquer: CH4 |
|
Week 3 |
3/9 |
Heapsort: CH6
Quicksort: CH7 |
|
Week 4 |
3/16 |
Sorting in Linear Time: CH8
Medians and Order Statistics: CH9
Quiz #1 (3/16 11:40am)
HW #1 in (before class)
HW #2 out |
|
Week 5 |
3/23 |
Binary Search Trees: CH12
Red-Black Trees: CH13
PA #1 in (3/26 Sun 1pm) |
|
Week 6 |
3/30 |
Dynamic Programming: CH15
PA #2 out |
|
Week 7 |
4/6 |
Dynamic Programming: CH15
Quiz #2 (4/6 11:40am)
HW #2 in (4/8 Sat 6pm; no late submission)
SAT solution (4/9) |
|
Week 8 |
4/13 |
Midterm (4/13 Thu 9:20am-12:10pm) |
|
Week 9 |
4/20 |
Greedy Algorithms: CH16
Amortized Analysis: CH17
PA #2 in (4/23 Sun 1pm)
HW #3 out |
|
Week 10 |
4/27 |
Amortized Analysis: CH17
Elementary Graph Algorithms: CH22 |
|
Week 11 |
5/4 |
Disjoint Sets: CH21
Minimum Spanning Trees: CH23 |
|
Week 12 |
5/11 |
Single-Source Shortest Paths: CH24
Quiz #3 (5/11 11:40am)
PA #3 out
HW #3 in (before class)
HW #4 out |
|
Week 13 |
5/18 |
All-Pairs Shortest Paths: CH25
Maximum Flow: CH26 |
|
Week 14 |
5/25 |
Maximum Flow: CH26
NP-completeness: CH34 |
|
Week 15 |
6/1 |
NP-completeness: CH34
Quiz #4 (6/1 11:40am)
DIY problem in (6/2 Fri 6pm)
HW #4 in (6/3 Sat 6pm; no late submission)
SAT solution (6/4) |
|
Week 16 |
6/8 |
Final (6/8 Thu 9:20am-12:10pm) |
|
Week 17 |
6/15 |
PA #3 in (6/15 Thu 1pm) |
|